A Matrix Method for Chromatic Polynomials -ii 1. Introduction
ثبت نشده
چکیده
The subject of this paper is the calculation of the chromatic polynomials of families of graphs that have cyclic symmetry. Generally speaking, there are no elegant methods in this eld. The standard method of deletion-and-contraction is both ineecient and inelegant: it requires exponentially many steps, and any symmetry that the graph possesses is destroyed at the very rst step. In this paper we consider families of graphs fG n g, where G n has n-fold cyclic symmetry, and we shall develop a method, introduced in 2], that uses this symmetry in a crucial way. There are two basic steps. First, we introduce a `compatibility operator' T, and apply the sieve principle to obtain an explicit formula for its action. Then we show that, in certain circumstances , it is possible to use this formula to construct invariant subspaces for T. Furthermore, the spectral decomposition of the action of T on these subspaces can be calculated (in principle). The resulting eigenvalues i and their multiplicities m i correspond to terms in the chromatic polynomial of G n , which takes the form It is signiicant that the eigenvalues occur inìevels', in such a way that the top levels are the simplest to compute and also the most important. It has been known for many years that results of this kind provide insight into physical processes. In this context, the behaviour of the zeros of P(G n ; z) as n ! 1 is of paramount importance. A result of Beraha, Kahane and Weiss 1] implies that the zeros approach curves deened by equations of the form j i (z)j = j j (z)j (i 6 = j): Shrock and Tsai 8] point out that these curves divide the complex plane into regions, in each of which the thermodynamic limit lim n!1 fP(G n ; z)g 1=n is a well-deened analytic function. A series of papers by Shrock and his colleagues (see 9] and the references given there) discusses the relationship between these ideas and the critical behaviour ofàntiferromagnets'. It appears that the curves that determine the critical regions are those corresponding to the eigenvalues at the top levels. The key elements of the method are described in Sections 2, 3, and 4. In Section 3 we obtain a general sieve formula for the action of T, and in Section 1
منابع مشابه
Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملChromatic polynomials of some nanostars
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
متن کاملA Matrix Method for Flow Polynomials
A method for calculating flow polynomials based on a transfer matrix is described. It is analogous to the method used for chromatic polynomials, although there is as yet no parallel development of the theory. The new method is applied to a family of bracelets, and the limit curves for the flow roots are obtained. There is an unexplained similarity between these calculations and the correspondin...
متن کاملRecursive Formulae for the Chromatic Polynomials of Complete r-uniform Mixed Interval Hypergraphs
In response to a problem of Voloshin, we find recursive formulae for the chromatic polyno-mials of complete r-uniform interval hypergraphs and cohypergraphs. We also give recursive formulae for the chromatic polynomials of complete 3-uniform and 4-uniform interval bihy-pergraphs and comment on the challenges for general r. Our method is to exploit the uniform and complete structure of these hyp...
متن کاملChromatic Polynomials
Table of contents Introduction 1. Relation of the present work to previous researches on map-coloring and summary of results. 356 2. Definitions. 358 Chapter I. First principles in the numerical and theoretical treatment of chromatic polynomials 1. The three fundamental principles. 362 2. The quadrilateral reduction formula. 363 3. The pentagon reduction formula. 365 4. The m-gon reduction form...
متن کاملA spectral method based on the second kind Chebyshev polynomials for solving a class of fractional optimal control problems
In this paper, we consider the second-kind Chebyshev polynomials (SKCPs) for the numerical solution of the fractional optimal control problems (FOCPs). Firstly, an introduction of the fractional calculus and properties of the shifted SKCPs are given and then operational matrix of fractional integration is introduced. Next, these properties are used together with the Legendre-Gauss quadrature fo...
متن کامل